A Logic for Hypothetical Reasoning
نویسنده
چکیده
This paper shows that classical logic is inappropriate for hypothetical reasoning and develops an alternative logic for this purpose. The paper focuses on a form of hypothetical reasoning which appears computationally tractable. Specifically, Horn-clause logic is augmented with rules, called embedded implications, which can hypothetically add atomic formulas to a rulebase. By introducing the notion of ruZebuse independence, it is shown that these rules can express hypothetical queries which classical logic cannot. By adopting methods from modal logic, these rules are then shown to be intuitionistic. In particular, they form a subset of intuitionistic logic having semantic properties similar to those of Horn-clause logic.
منابع مشابه
COMBINING HYPOTHETICAL REASONING a n d PLAUSIBLE INFERENCE IN POSSIBILISTIC LOGIC*
Possibilistic logic provides an efficient tool for handling uncertain and nonmonotonic reasoning on the one hand, and for hypothetical reasoning on the other hand. In the first situation, logic formulas are simply weighted by lower bounds of a necessity measure. Thus, formulas in a knowledge base are rank-ordered according to their levels of certainty. In the case of hypothetical reasoning, the...
متن کاملAn efficient hypothetical reasoning system for predicate-logic knowledge-base
A hypothetical reasoning system & an important framework in the development of advanced knowledge-based systems. It can be effectively applied to many practical problems including model-based diagnosis, and designs. However, the inference speed of its PROLOG-based implementation is slow, and this is particularly because of inefficient backtracking. In order to overcome this problem, a fast hypo...
متن کاملA Predicate-logic Version Method for Cost-based Hypothetical Reasoning Employing an E cient Propositional-level Reasoning Mechanism
For propositional-level hypothetical reasoning (or abduction), particularly for its cost-based variant, some e cient methods have been developed which achieve polynomial-time reasoning (with respect to problem size) to compute a near-optimal solution. However, for predicate-logic version hypothetical reasoning, which allows rich and compact knowledge representation, it seems di cult to nd a met...
متن کاملA Polynomial-Time Predicate-Logic Hypothetical Reasoning by Networked Bubble Propagation Method
Hypothetical reasoning is a useful knowledge-processing framework applicable to many problems including system diagnosis, design, etc. However, due to its non-monotonic inference nature, it takes exponential computation-time to nd a solution hypotheses-set to prove a given goal. This is also true for cost-based hypothetical reasoning to nd an optimal solution with minimal cost. As for the hypot...
متن کاملHypothetical-Reasoning and Radical Non-constituent Coordination in Categorial Logic
The paper investigates the connection between non-constituent coordination, as implemented in categorial grammar by means of a polymorphic type-assignment to lexical conjunctions, and hypothetical reasoning in Categorial Logics. A way of extending the logic is suggested, so that coordination can be applied to types depending on undischarged assumptions. By a certain \resource manipulation" of a...
متن کامل